Abstract State Machines 1988-1998: Commented ASM Bibliography

نویسندگان

  • Egon Börger
  • James K. Huggins
چکیده

This is the current version of an annotated bibliography of papers which deal with or use ASMs. It is compiled to a great extent from references and annotations provided by the authors of the listed papers and extends the annotated bibliography which previously appeared in [20]. Comments, additions and corrections are welcome and should be sent to [email protected] and [email protected] . Hartmut Ehrig asked the first author to write for this column what are the distinguishing features of the ASM approach to specification and verification of complex computing systems. In [21] an attempt had already been made to answer that question by discussing, in general comparative terms, some specific features which are characteristic for the ASM approach with respect to other well known approaches in the literature. That explanation seems to have been understood, as shown by the many positive reactions, but even more the numerous critical reactions of colleagues in the field who felt—rightly—that ASMs put justified doubt on cherished denotational, declarative, logical, functional and similar widespread beliefs in pure, i.e. not operational methods. Nevertheless some dissatisfaction remained with that paper because the discussion, in a sense unavoidably, remained in general terms which have been used during the last two or three decades again and again for the justification of many other methods. The attempt to answer the question in a more concrete way led the two authors of this commented bibliography to systematically review again, revising and updating [20], what are the achievements and failures of ASM research since the discovery of the notion by Yuri Gurevich in 1988. What follows here is a way of answering Hartmut Ehrig’s question; namely, we try to let the research results speak for the method. If somebody really wants to know whether there is anything useful in the notion of ASM which has not been covered by competing methods in the literature, he or she should try out the method on a challenging (not a toy) specification or verification problem. We have no doubt that then it will become clear why so much successful research could be done in such a short period by a relatively small number of researchers, as documented in the commented bibliography below. Current updates of this bibliography (as well as some of the papers listed below) will be available on the ASM web sites http://www.eecs.umich.edu/gasm and http://www.uni-paderborn.de/cs/asm.html.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

THE LOGIC IN COMPUTER SCIENCE COLUMN 1 by Yuri GUREVICH

The thesis is that every sequential algorithm, on any level of abstraction, can be viewed as a sequential abstract state machine [Gurevich 1985, 1991]. Abstract state machines (ASMs) used to be called evolving algebras. The sequential ASM thesis and its extensions [Gurevich 1995] inspired diverse applications of ASMs. The early applications were driven, at least partially, by the desire to test...

متن کامل

The ASM Workbench: an Open and Extensible Tool Environment for Abstract State Machines

Appropriate tool support is an essential factor for an eeec-tive application of formal methods to real-life speciication and modelling tasks. However, the current state of the art of tool support for Abstract State Machines is not considered very satisfactory by practitioners. After discussing some possible reasons for this, we report about the ASM Workbench, an open and extensible tool environ...

متن کامل

Sequential ASM Thesis

The thesis is that every sequential algorithm, on any level of abstraction, can be viewed as a sequential abstract state machine [Gurevich 1985, 1991]. Abstract state machines (ASMs) used to be called evolving algebras. The sequential ASM thesis and its extensions [Gurevich 1995] inspired diverse applications of ASMs. The early applications were driven, at least partially, by the desire to test...

متن کامل

The Origins and the Development of the ASM Method for High Level System Design and Analysis

The research belonging to the Abstract State Machines approach to system design and analysis is surveyed and documented in an annotated ASM bibliography. The survey covers the period from 1984, when the idea for the concept of ASMs (under the name dynamic or evolving algebras or structures) appears for the first time in a foundational context, to the year 2001 where a mathematically well-founde...

متن کامل

Ten Years of Gurevich's Abstract State Machines

State Machines have come quite a way since they have been discovered by Yuri Gurevich in an attempt to improve on Turing's thesis so that: Every algorithm can be simulated in lock{step on its natural abstraction level by an ASM. The rst years after the de nition of ASMs appeared in the literature (under the name of dynamic or evolving algebras, see [Gurevich 1988]) were characterized by an impr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Bulletin of the EATCS

دوره 64  شماره 

صفحات  -

تاریخ انتشار 1998